Search results for "Higher-order logic"
showing 4 items of 4 documents
Monadic second-order logic over pictures and recognizability by tiling systems
1994
We show that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system if and only if it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and matches a natural logic. The proof is based on the Ehrenfeucht-FraIsse technique for first-order logic and an implementation of “threshold counting” within tiling systems.
Logics with counting and equivalence
2014
We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.
Employing fuzzy logic in the diagnosis of a clinical case
2010
Fuzzy logic is a logical calculus which operates with many truth values (while classical logic works with the two values of true and false). Since fuzzy logic considers the truth of scientific statements like something softened, it is fruitfully applied to the study of biological phenomena, biology is indeed considered the field of complexity, uncertainty and vagueness. In this paper fuzzy logic is successfully applied to the clinical diagnosis of a patient who suffers from different diseases bound by a complex causal chain. In this work it is presented a mathematical foundation of fuzzy logic (with connectives and inference rules) and then the application of fuzzy reasoning to the study of…
Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems
1996
Abstract It is shown that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system iff it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and also matches a natural logic. The proof is based on the Ehrenfeucht–Fraisse technique for first-order logic and an implementation of “threshold counting” within tiling systems.